Vectorization with the Voronoi L-diagram
نویسندگان
چکیده
A new precision vectorization method has been developed for building centerlines of plain shapes. First a dense skeleton is computed. Centerlines are obtained as a subset of branches of the dense skeleton. The dense skeleton can also be used for obtaining medial axes of shapes. To obtain high precision, the distance transformation 12-17-38 was developed, which gives a good approximation of the Euclidean metrics. The expression the Voronoi L-diagram was coined.
منابع مشابه
L∞ Voronoi Diagrams and Applications to VLSI Layout and Manufacturing
In this paper we address the L∞ Voronoi diagram of polygonal objects and present applications in VLSI layout and manufacturing. We show that in L∞ the Voronoi diagram of segments consists only of straight line segments and is thus much simpler to compute than its Euclidean counterpart. Moreover, it has a natural interpretation. In applications where Euclidean precision is not particularly impor...
متن کاملThe L∞ Hausdorff Voronoi Diagram Revisited
We revisit the L∞ Hausdorff Voronoi diagram of clusters of points, equivalently, the L∞ Hausdorff Voronoi diagram of rectangles, and present a plane sweep algorithm for its construction that generalizes and improves upon previous results. We show that the structural complexity of the L∞ Hausdorff Voronoi diagram is Θ(n+m), where n is the number of given clusters and m is the number of essential...
متن کاملRandomized construction diagrams * incremental of abstract Voronoi Rolf
Abstract Voronoi diagrams were introduced by R. Klein (1988) as an axiomatic basis of Voronoi diagrams. We show how to construct abstract Voronoi diagrams in time O(n log n) by a randomized algorithm, which is based on Clarkson and Shor’s randomized incremental construction technique (1989). The new algorithm has the following advantages over previous algorithms: l It can handle a much wider cl...
متن کاملNear Pole Polar Diagram of Points and its Duality with Applications
In this paper we propose a new approach to plane partitioning with similar features to those of Polar Diagram, but we assume that the pole is close to the sites. The result is a new tessellation of the plane in regions called Near Pole Polar Diagram NPPD. Here we define the (NPPD) of points, the dual and the Contracted dual of it, present an optimal algorithms to draw them and discuss the appli...
متن کاملThe L∞ (L1) Farthest Line-Segment Voronoi Diagram
We present structural properties of the farthest line-segment Voronoi diagram in the piecewise linear L∞ and L1 metrics, which are computationally simpler than the standard Euclidean distance and very well suited for VLSI applications. We introduce the farthest line-segment hull, a closed polygonal curve that characterizes the regions of the farthest line-segment Voronoi diagram, and is related...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003